Classification Pruning for Web-request Prediction
نویسندگان
چکیده
N-gram and repeating pattern based prediction rules have been used for next-web request prediction. However, there is no rigorous study of how to select the best rule for a given observation. The longer patter may not be the best pattern, because such patters are also more rare. In this paper, we propose several rule-pruning methods that enable us to build efficient, compact and high-quality classifiers for webrequest prediction.
منابع مشابه
A Markov-based Web Prediction Model
A web prediction model helps to predict user requests ahead of time, making web servers more responsive. Several prediction techniques have been tried in the past; Markov based prediction models being the most popular ones. Among these, the All-K-order Markov model has been found to be most effective. We designed a Markov tree, which is a fourth order model but behaves like an All-K-order Marko...
متن کاملEvaluation of liquefaction potential based on CPT results using C4.5 decision tree
The prediction of liquefaction potential of soil due to an earthquake is an essential task in Civil Engineering. The decision tree is a tree structure consisting of internal and terminal nodes which process the data to ultimately yield a classification. C4.5 is a known algorithm widely used to design decision trees. In this algorithm, a pruning process is carried out to solve the problem of the...
متن کاملA Survey on User Future Request Prediction: Web Usage Mining
Web Usage Mining is an important type of Web Mining, which deals with extraction of interesting knowledge from the web log files. The lots of research has done in this field but basically this paper emphasize on user future next request prediction using web log record, click streams record and user information. The aim of this paper is to provide past, current evaluation and update in web usage...
متن کاملMulti-label Classification for Tree and Directed Acyclic Graphs Hierarchies
Hierarchical Multi-label Classification (HMC) is the task of assigning a set of classes to a single instance with the peculiarity that the classes are ordered in a predefined structure. We propose a novel HMC method for tree and Directed Acyclic Graphs (DAG) hierarchies. Using the combined predictions of locals classifiers and a weighting scheme according to the level in the hierarchy, we selec...
متن کامل“Web Personalization: User‟s Future Request Prediction”: A Survey
The web mining is very interesting research topic which supports two of the activated research areas namely Data Mining and World Wide Web. The process of extracting knowledge and information from World Wide Web is defined as web mining. This paper is a survey based on recent work in the field of Web Usage Mining, an important type of web mining. It extracts required information from web log fi...
متن کامل